Variable resolution Poisson-disk sampling for meshing discrete fracture networks
نویسندگان
چکیده
We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions variable resolution Delaunay triangular and tetrahedral meshes in two three-dimensions, respectively. nMAPS consists of principal stages. In first stage, an initial distribution is produced using a cell-based rejection algorithm. second holes sample are detected efficient background grid filled obtain near-maximal covering. Extensive testing shows that generates mesh linear run time with number accepted points. demonstrate capabilities by meshing three-dimensional discrete fracture networks (DFN) surrounding volume. The discretized boundaries fractures, which represented as planar polygons, used seed 2D-nMAPS produce conforming triangulation. combined DFN 3D-nMAPS, produces tetrahedra network. Under set conditions naturally arise maximal samples satisfied nMAPS, two-dimensional triangulations guaranteed only have well-behaved faces. While does not provide triangulation quality bounds more than dimensions, we found low-quality 3D infrequent, can be readily removed, high balanced produced.
منابع مشابه
Tetrahedral meshing via maximal Poisson-disk sampling
Article history: Available online 15 February 2016
متن کاملVariable Radii Poisson Disk Sampling
We introduce three natural and well-defined generalizations of maximal Poisson-disk sampling. The first is to decouple the disk-free (inhibition) radius from the maximality (coverage) radius. Selecting a smaller inhibition radius than the coverage radius yields samples which mix advantages of Poisson-disk and uniform-random samplings. The second generalization yields hierarchical samplings, by ...
متن کاملVariable Radii Poisson - Disk Sampling extended version
We introduce three natural and well-defined generalizations of maximal Poisson-disk sampling. The first is to decouple the disk-free (inhibition) radius from the maximality (coverage) radius. Selecting a smaller inhibition radius than the coverage radius yields samples which mix advantages of Poisson-disk and uniform-random samplings. The second generalization yields hierarchical samplings, by ...
متن کاملEfficient Generation of Poisson-Disk Sampling Patterns
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and other computations. Until now, such patterns could only be generated by slow methods with poor convergence, or could only be approximated by jittering individual samples or tiling sets of samples. We present a simple and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2022
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2022.114094